COMP9103 - 07s2 Complexity and Logic
نویسنده
چکیده
Recursive functions: computable on a TM; might be partial (i.e., the TM might not stop for some inputs). Intuitively, recursive functions are computable using WHILE-loop – without any priori bound on the number of iterations of the loop. (Cook the potatoes until tender.) Primitive recursive functions: A smaller class, computable using a loop of the form FOR i < g(x) DO · · · , where g(x) is previously defined primitive recursive function. (Cook the potatoes for ten minutes.) More formally:
منابع مشابه
A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers
This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...
متن کاملLogic regression and its application in predicting diseases
Regression is one of the most important statistical tools in data analysis and study of the relationship between predictive variables and the response variable. in most issues, regression models and decision tress only can show the main effects of predictor variables on the response and considering interactions between variables does not exceed of two way and ultimately three-way, due to co...
متن کاملRestoring Motor Functions in Paralyzed Limbs through Intraspinal Multielectrode Microstimulation Using Fuzzy Logic Control and Lag Compensator
In this paper, a control strategy is proposed for control of ankle movement on animals using intraspinal microstimulation (ISMS). The proposed method is based on fuzzy logic control. Fuzzy logic control is a methodology of intelligent control that mimics human decision-making process. This type of control method can be very useful for the complex uncertain systems that their mathematical model ...
متن کاملLow Delay Time All Optical NAND, XNOR and OR Logic Gates Based on 2D Photonic Crystal Structure
Background and Objectives: Recently, photonic crystals have been considered as the basic structures for the realization of various optical devices for high speed optical communication. Methods: In this research, two dimensional photonic crystals are used for designing all optical logic gates. A photonic crystal structure with a triangular lattice is proposed for making NAND, XNOR, and OR optica...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کامل